Balanced matrices
نویسندگان
چکیده
"Dipartimento di Matematica Pura ed Applicata, Universiti di Padova, Via Belzoni 7, 35131 Padova, Italy. tCarnegie Mellon University, Schenley Park, Pittsburgh, PA 15213. ICarnegie Mellon University, Schenley Park, Pittsburgh, PA 15213. §Indian Institute of Management, Bannerghatta rd. 560076 Bangalore, India. 1 Carnegie Mellon University, Schenley Park, Pittsburgh, PA 15213. This work was supported in part by NSF grants DDM-9201340 and DDM-9001705 and ONR grant N00014-89-J-1063.
منابع مشابه
Balanced 0, ±1 Matrices Part I. Decomposition
A 0; 1 matrix is balanced if, in every square submatrix with two nonzero entries per row and column, the sum of the entries is a multiple of four. This paper extends the decomposition of balanced 0; 1 matrices obtained by Conforti, Cornu ejols and Rao to the class of balanced 0; 1 matrices. As a consequence, we obtain a polynomial time algorithm for recognizing balanced 0; 1 matrices.
متن کاملNew Constructions of Balanced Quasi-Cyclic Generalized Hadamard Matrices
In this paper, we define quasi-cyclic (QC) generalized Hadamard matrices and balanced QC generalized Hadamard matrices. Then we propose a new construction method for QC generalized Hadamard matrices. The proposed matrices are constructed from the balanced optimal low correlation zone (LCZ) sequence set which has correlation value −1 within low correlation zone.
متن کاملBalanced 0-1 Matrices I. Decomposition
A 0, \1 matrix is balanced if, in every square submatrix with two nonzero entries per row and column, the sum of the entries is a multiple of four. This paper extends the decomposition of balanced 0, 1 matrices obtained by Conforti, Cornue jols, and Rao (1999, J. Combin. Theory Ser. B 77, 292 406) to the class of balanced 0, \1 matrices. As a consequence, we obtain a polynomial time algorithm f...
متن کاملQuasi-Cyclic Generalized Hadamard Matrices
In this paper, we define quasi-cyclic(QC) generalized Hadamard matrices and balanced QC generalized Hadamard matrices. Then we propose a new construction method for QC generalized Hadamard matrices. The proposed matrices are constructed from the balanced optimal low correlation zone(LCZ) sequence set which has correlation value −1 within low correlation zone.
متن کاملRecognizing Balanceable Matrices
A 0/ ± 1 matrix is balanced if it does not contain a square submatrix with exactly two nonzero entries per row and per column in which the sum of all entries is 2 modulo 4. A 0/1 matrix is balanceable if its nonzero entries can be signed ±1 so that the resulting matrix is balanced. A signing algorithm due to Camion shows that the problems of recognizing balanced 0/ ± 1 matrices and balanceable ...
متن کاملBalanced Generalized Weighing Matrices and their Applications
Balanced generalized weighing matrices include well-known classical combinatorial objects such as Hadamard matrices and conference matrices; moreover, particular classes of BGW -matrices are equivalent to certain relative difference sets. BGW -matrices admit an interesting geometrical interpretation, and in this context they generalize notions like projective planes admitting a full elation or ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 306 شماره
صفحات -
تاریخ انتشار 2006